An HMM-based approach for off-line unconstrained handwritten word modeling and recognition

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An HMM-Based Approach for Off-Line Unconstrained Handwritten Word Modeling and Recognition

ÐThis paper describes a hidden Markov model-based approach designed to recognize off-line unconstrained handwritten words for large vocabularies. After preprocessing, a word image is segmented into letters or pseudoletters and represented by two feature sequences of equal length, each consisting of an alternating sequence of shape-symbols and segmentationsymbols, which are both explicitly model...

متن کامل

Off-line Arabic Handwritten Recognition Using a Novel Hybrid HMM-DNN Model

In order to facilitate the entry of data into the computer and its digitalization, automatic recognition of printed texts and manuscripts is one of the considerable aid to many applications. Research on automatic document recognition started decades ago with the recognition of isolated digits and letters, and today, due to advancements in machine learning methods, efforts are being made to iden...

متن کامل

HMM-based handwritten symbol recognition using on-line and off-line features

This paper addresses the problem of recognizing on-line sampled handwritten symbols. Within the proposed symbol recognition system based on Hidden Markov Models different kinds of feature extraction algorithms are used analysing on-line features as well as off-line features and combining the classification results. By conducting writer-dependent recognition experiments, it is demonstrated that ...

متن کامل

A Lexicon Driven Approach for Off-line Recognition of Unconstrained Handwritten Korean Words

We propose a new method for the recognition of unconstrained handwritten words consisting of Korean and numeric characters. To overcome the difficulty in separating touching characters, we adopt an oversegmentation technique and we find the optimal segment combination using a lexicon-driven word scoring technique and a nearest neighbor classifier. The optimal combination gives the final segment...

متن کامل

Off-line Cursive Handwritten Word Recognition Based on Tree Extraction and an Optimized Classification Distance

This paper describes a geometric approach to the difficult off-line handwritten word recognition problem. The method classifies feature trees from isolated handwritten words, measuring the distance between two trees. The nearest-neighbour method has been used to classify the prototypes and the leaving-one-out criterion has been applied in order to test the classifier.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Pattern Analysis and Machine Intelligence

سال: 1999

ISSN: 0162-8828

DOI: 10.1109/34.784288